This report describes the method we used for solving Sokoban.  Two agents attempts to solve the board from the forward and reverse directions, in parallel. We use a bounded Astar approach to search, along with a cost functions based on the actual distances (taking into account of the obstacles) of a box from the target .  We have noted that different heuristics work better for different boards.
   
